Minimax Results on Dense Sets and Dense Families of Functionals
نویسندگان
چکیده
منابع مشابه
On strongly dense submodules
The submodules with the property of the title ( a submodule $N$ of an $R$-module $M$ is called strongly dense in $M$, denoted by $Nleq_{sd}M$, if for any index set $I$, $prod _{I}Nleq_{d}prod _{I}M$) are introduced and fully investigated. It is shown that for each submodule $N$ of $M$ there exists the smallest subset $D'subseteq M$ such that $N+D'$ is a strongly dense submodule of $M$ and $D'bi...
متن کاملDense and Non-Dense Families of Complexity Classes
Let t be any abstract measure of computational complexity, and let L denote the specific measure of memory resource (tape) on one tape Turing machines. De~ote by R:() the class of all total functions whose t-complexity is bounded by the function t() almost everywhere. Call such classes t-complexity classes. We are interested in relationships among these classes, under proper set inclusion (C). ...
متن کاملGroupwise dense families
We show that the Filter Dichotomy Principle implies that there are exactly four classes of ideals in the set of increasing functions from the natural numbers. We thus answer two open questions on consequences of < . We show that < implies that = , and that Filter Dichotomy together with < implies < . The technical means is the investigation of groupwise dense sets, ideals, filters and ultrafilt...
متن کاملDense Admissible Sets
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let ρ ∗(x) be the size of the largest admissible set in [1, x]. The Prime k-tuples Conjecture states that any for any admissible set, there are infinitely many n such that n+b1, n+b2, . . . n+bk are simultaneously prime. In 1974, Hensley and Richards ...
متن کاملDense forests and Danzer sets
A set Y ⊆ R that intersects every convex set of volume 1 is called a Danzer set. It is not known whether there are Danzer sets in R with growth rate O(T ). We prove that natural candidates, such as discrete sets that arise from substitutions and from cut-and-project constructions, are not Danzer sets. For cut and project sets our proof relies on the dynamics of homogeneous flows. We consider a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2017
ISSN: 1052-6234,1095-7189
DOI: 10.1137/16m1092714